Fast Adder Design using Redundant Binary Numbers with Reduced Chip Complexity
نویسنده
چکیده
Abstract—Redundant Binary Signed Digit Adder and Multiplier circuits are logic circuits which are designed to perform high-speed arithmetic operations. Fast RBSD adder cell, proposed by Kal and Rajshekhar in 1990 was modified by Neelam Sharma in 2006 using universal logic. The proposed adder is re-modified for reducing the number of gates and thus the circuit complexity and cost. Further due to the reduced gate count, circuit area, number of levels and hence implementation time is reduced up to 1% as proved by VHDL synthesis report. Since multiplication is repetitive addition, the implementation time of the multiplier circuit will be reduced to a great extent. Thus the proposed RBSD adder cell using NOR and NAND gates will be a boost in the speed of sophisticated ALU Design of high speed machines.
منابع مشابه
Design of Fast Pipelined Multiplier using Modified Redundant Adder
Carry free arithmetic using higher radix number system such as Redundant Binary Signed Digit can be used to meet the demand for computers operating at much higher speeds. The computation speed can also be increased by using the suitable design of adder and multiplier circuits. Fast RBSD adder cells suggested by Neelam Sharma in 2006 using universal logic are modified in the proposed design by r...
متن کاملDesign of a Multiplier for Similar Base Numbers Without Converting Base Using a Data Oriented Memory
One the challenging in hardware performance is to designing a high speed calculating unit. The higher of calculations speeds in a computer system will be pointed out in terms of performance. As a result, designing a high speed calculating unit is of utmost importance. In this paper, we start design whit this knowledge that one multiplier made of several adder and one divider made of several su...
متن کاملASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm
Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...
متن کاملMultiple-Valued Signed-Digit Adder Using Negative Differential-Resistance Devices
This paper describes a new signed-digit full adder (SDFA) circuit consisting of resonant-tunneling diodes (RTDs) and metal-oxide semiconductor field effect transistors (MOSFETs). The design is primarily based on a multiple-valued logic literal circuit that utilizes the folded-back I-V (also known as negative differential-resistance, NDR) characteristics of RTDs to compactly implement its gated ...
متن کاملFast Parallel Multiplication with Parallel On-the-fly Conversion
Fast multiplication can be constructed by combining the tree structure of multiplication's addition, i.e. Wallace tree, with the parallel on-they conversion to have a multiplication without using any carry propagation adder at the end. This parallel on-they conversion speeds up the conversion of redundant binary to conventional binary. With the delay of n 4 , we can have the conversion from red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011